Method and apparatus for spectral shaping in signal-point limited transmission systems

ABSTRACT

A method and apparatus for performing spectral shaping transmitted samples with a set of predetermined frequency characteristics and a predetermined set of allowable transmitted signal levels are disclosed. The method first calculates, for each of the transmitted samples, a running measure of unwanted components upto the current sample. It then computes, for each block of the transmitted samples, an objective function based on the running measure previously calculated. It then selects, for each block of the transmitted samples, at least one redundant sample to be added or at least one transmitted sample to be modified, at structured or randomized location within the block to optimize the objective function. The location of the dependent sample can further be fixed, scrambled (pseudo random) or randomized. The method of computing can be any one of the following: a Running Filter Sum, a Running Fourier Transform (“RFT”) or Fast FT (“RFFT”), or an RDS, for each transmitted sample.

CROSS-REFERENCE TO RELATED APPLICATIONS

Not Applicable

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not Applicable

REFERENCE TO A “MICROFICHE APPENDIX”

Not Applicable

BACKGROUND OF THE INVENTION

The present invention relates to transmission of digital information over analog medium connected to a digital network and more particularly to the PCM modems (“Pulse Code Modulation”).

The world based on the Internet has seen tremendous growth in recent months. As more users begin browsing and downloading information from the World Wide Web, there has been a great desire to be able to increase the data rate. The desire is even greater for users accessing the Internet through an Internet service provider (ISP), since most of the users are linked up to the Net through a personal computer and a modem. Conventional analog modems, such as the V.34 modems, however, view the public switched telephone network (“PSTN”) as an analog channel, even though the signals are digitized for communications throughout most of the network. As such, various effects and impairments due to quantization impose a limitation on the data rate of the channel to about 35 Kbps. This limit has been commonly known as Shannon's Limit. (See Shannon, C. E. and W. Weaver, The Mathematical Theory of Communication, University of Illinois Press, 1949).

There has been a recent development of a high-speed communications technology based on the PCM modems, where data rate of at least 56 Kbps is said to be actually attainable. The PCM modem technology is based on the simple realization that the public switched telephone networks (PSTN) is increasingly a digital network and not an analog network. Also, more and more central site modems are connected to the PSTN through digital connections, i.e. T1 in the U.S. and E1 in Europe, without utilizing a CODEC (coder/decoder). The conventional modem, however, still interprets this digital stream as the representation of the modem's analog signal. With the PCM modems, a much higher data rate can be achieved without the complicated task of re-wiring the user's site or modifying the telephone network.

Note that by “central site modems,” it is referred to those modems installed at an ISP, or at a corporation to allow many simultaneous connections for remote LAN access. Also note that a CODEC is a device which sits between the digital portion of the network and the analog local loop for converting between analog and digital.

The recent 56 Kbps technology seeks to address an impaired section of the communications path of the PSTN digital network, where the impairment is due to the hybrid and the copper wire connection between the telephone central office and the user's home, usually referred to as the analog local loop.

Since recently, much has been described about the PCM modems and how they can and should facilitate downstream data communication at a much higher rate than present paradigm. For example, the PCM modem has been the subject of a recent Telecommunications Industry Association (TIA) Technical Committee TR-30 Standards meeting on Oct. 16-17, 1996. The submitted technical contributions include Mr. Guozhu Long's DC Suppresser for 56K Modems, Mr. David C. Rife's 56 Kbps Channels, Mr. Veda Krishnan's V.pcm Modem Standard, Mrs. Vedat Eyuboglu's PCM Modems: A Technical Overview, Mr. Richard Stuart's Proposal for a High Speed Network Access Modem, and Mr. Vladimir Parizhsky's U.S. Robotics' x2 Technology: Technical Brief. These contributions are hereby incorporated by reference.

Also, there have been recent publications on the overall data communication system based on the PCM modem. The first one is a 1995 presentation disclosed by Pierre A. Humblet and Markos G. Troulis at Institute Eurecom, entitled The Information Driveway, 1995, which purports to explain the basic concepts on the high speed modem. The second one is a PCT Patent Publication, dated Jun. 13, 1996, International Publication Number WO/9618261, by Brent Townshend, which discloses a High Speed Communications Systems for Analog Subscriber Connections. This Publication, on pages 17-19, discloses an overall high speed system based on the PCM modems, which also implements DC null elimination on the transmitter side. These are also hereby incorporated by reference, since they provide a fair reference to the basics of the high speed PCM modems and their environment.

Additionally, U.S. patent issued to Ender Ayanoglu of AT&T, U.S. Pat. No. 5,528,625 dated Jun. 18, 1996, entitled High Speed Quantization-Level-Sampling Modem with Equalization Arrangement, discloses a QLS modem for high-speed data communication. Another U.S. patent also issued to Ender Ayanoglu of AT&T, U.S. Pat. No. 5,394,437, dated Feb. 28, 1995, entitled High-Speed Modem Synchronized to a Remote CODEC, discloses a high-speed modem for data transmission over an analog medium in tandem with a digital network. These references are also hereby incorporated by reference.

FIG. 1 depicts a conceptual diagram of the high-speed communication path using the PCM modem technology. An ISP, or “central site”, 100 is digitally connected to a telephone network 130 through its transmitter 110 and receiver 120. The network 130 is connected to a local loop 150 through a central office line card 140. The line card typically has a Pulse Code Modulation (“PCM”) CODEC implemented within. The local loop 150 is connected to the user's PC at the user's site through the user's modem 160. As can be appreciated by those skilled in the art, the connection between the ISP modem's transmitter 110 to the telephone network 130 is a digital connection with a typical data rate of about 64 Kbps. Since the parameters of the telephone network 130 and line card 140 are dictated and set by telephone company's specification and operation, the central site transmitter 110 will need to transmit the digital data in certain way to fully exploit its digital connection to the network. However, dealing with the central site transmitter in this new paradigm has its obstacles.

In this type of data communication systems, such as the transmitter 110 in the central site, the transmit signal points are determined by physical constraints, and cannot be made part of the overall transmitter design. An example is when a signal is transmitted from within the digital part of the telephone network to the residential customer. That system will be the focus of the following description, although the methods described hereinafter will in many cases be applicable to other systems.

The transmitter 110 sends 64 Kbps of data into the network 130, which eventually gets translated to an analog signal in a digital-to-analog converter in a central office line-card CODEC 140. To send the maximum of 64 Kbps of data, all transmitted bits must be determined by the incoming data. Any modification of the outgoing sequence of bits resulting in correlation between the bits represents a redundancy in the signal, and will thus result in a lower data rate. Therefore, if the analog signal is to be controlled in any way, the data rate must be lowered. The main task confronting the designers, then, is to perform the desired control with the least amount of redundancy added.

As will be described in the present application, methods and apparatus for controlling the spectrum of the line codec's output signal are disclosed. In particular, methods of minimizing the energy of the signal at unwanted frequencies are described. These methods can be readily extended to other parts of the spectrum by those skilled in the art based on the teaching of the present invention.

Impairments Presented by the Communication Channel

There are other difficulties from the channel which affect the implementation of the PCM modem and the information transmission. The communication channel from the line card PCM CODEC to the user's modem can be characterized by 4 primary functional units: the codec's anti-aliasing filter, the line card circuit, the subscriber loop and the modem's input circuit.

First, the CODEC anti-aliasing filter is mostly flat, starting to attenuate the signal at about 3.5 kHz and increasing to 15-20 dB at 4 kHz.

Second, the line card circuit is in some ways the most challenging impairment. It is difficult to characterize, since there are many types in use, and it has been designed to transmit a voice signal rather than a data signal. The hybrid transformer circuit includes a null at 0 Hz, and may induce high levels of nonlinear distortion, especially on signals with low-frequency energy.

Third, the subscriber loop itself is generally a linear impairment, creating inter- symbol interference (ISI) and picking up largely Gaussian noise. Non-Gaussian noise sources are near-end crosstalk (“NEXT”), far-end crosstalk (“FEXT”) and single frequency interference (SFI). The prime source of SFI is the electricity distribution network, adding a 50 or 60 Hz tone to the signal.

Finally, the modem input circuit consists of a line interface, including a hybrid transformer, and an analog-to-digital converter (ADC). The hybrid introduces a null in the spectrum at 0 Hz, and may also induce nonlinearities. However, since the signal level at the modem end is lower than at the central office, and the transformer can be part of the receiver design, nonlinear distortion in the modem input circuit will generally be minimal compared to that added by the central office line card. While the ADC will of course add quantization noise, which can be made negligible by design, many ADC's will add Gaussian-type noise, often with a “1/f” spectral characteristic, i.e. with highest energy at the low-frequency end of the spectrum. Also, a DC offset can be expected in the ADC, requiring some compensation by the receiver.

Given these impairments, it might seem difficult to take advantage of the low-end of the spectrum. The two transformer hybrids introduce nulls at 0 Hz, SFI is mostly around 50-60 Hz, and nonlinear distortion is increased if energy is transmitted at low frequencies (and will extend into higher frequencies). ADC noise also tends to be most prevalent at low frequencies.

Thus, it is desirable to simplify the receiver design by having the transmitter avoid sending energy at low frequencies. Without the low frequency energy, the receiver may elect to simply implement a high-pass filter to filter out noise there without the need to reconstruct the signal component removed.

In the following disclosure of the present invention, methods will be disclosed for controlling the sequence of bits transmitted to the line card CODEC to eliminate as much energy as possible at low frequencies. For illustration purposes, the following disclosure will assume a redundancy of 4 Kbps, where 4 Kbps out of the 64 Kbps are generated based on the other bits. Generally, a higher redundancy may improve the performance, and the methods disclosed herein can readily be modified for a different level of redundancy.

BRIEF SUMMARY OF THE INVENTION

A method and apparatus for performing spectral shaping transmitted samples with a set of predetermined frequency characteristics and a predetermined set of allowable transmitted signal levels are disclosed. The method first calculates, for each of the transmitted samples, a running measure of unwanted components upto the current sample. It then computes, for each block of the transmitted samples, an objective function based on the running measure previously calculated. It then selects, for each block of the transmitted samples, at least one redundant sample to be added or at least one transmitted sample to be modified, at structured or randomized location within the block of samples to optimize the objective function. The location of the dependent sample can further be fixed, scrambled (pseudo random) or randomized. The method of computing can be any one of the following: a Running Filter Sum, a Running Fourier Transform (“RFT”) or Fast FT (“RFFT”), or an RDS, for each transmitted sample.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE INVENTION

Additional objects, advantages and features of the present invention will be disclosed in the following description, wherein:

FIG. 1 depicts a conceptual diagram of the high-speed communication path using the PCM modem technology.

FIG. 2 illustrates a block diagram of the environment where the spectral shaping methodology in accordance with one aspect of the present invention is applicable.

FIG. 3 illustrates a generalized process flow of the lossless spectral shaping methodology in accordance with the present invention.

FIG. 4 illustrates the signal spectrum with simple redundant-sample method, where the null is at 0 Hz.

FIG. 5 illustrates the signal spectrum with simple redundant-sign method, where the null is at 0 Hz.

FIG. 6 illustrates the signal spectrum with simple redundant-sample method, where the null is now at 60 Hz.

FIG. 7 illustrates the signal spectrum with simple redundant-sign method, where the null is at 60 Hz.

FIGS. 8 and 9 illustrate the signal spectrum with multiple frequency redundant-sample and multiple frequency redundant-sign methods, respectively, with nulls at 0 Hz and 60 Hz.

FIGS. 10 and 11 illustrate the signal spectrums with redundant-sign block code method, where block size is 4 and nulls at 0, 60 Hz and 0, 30, 60 Hz, respectively.

FIGS. 12 and 13 illustrate the signal spectrum for the block size of 8, inserting nulls at 0, 60 Hz and 0, 6, 12, 18, . . . , 60 Hz, respectively.

FIG. 14 illustrates the signal spectrum of the sequence constructed by the redundant-sign method for a block length of N=4 with a redundancy of {fraction (1/16)}.

FIG. 15 illustrates the signal spectrum of the sequence constructed by the redundant-sample method.

DETAILED DESCRIPTION OF THE INVENTION

Methods and apparatus for spectral shaping in signal-point limited transmission systems are disclosed. In the following description, various aspects of the present invention are presented in terms of process flows, functional block diagrams and even mathematical expressions, which are the ways those skilled in the art communicate with each other in conveying their ideas and designs.

FIG. 2 illustrates a block diagram showing one environment where the spectral shaping in accordance with one aspect of the present invention is applicable. Source samples 200 from a data source, such as the ISP's server, are transmitted by a transmitter 210 (of an ISP modem) to generate transmitted samples 220. The transmitted samples 220 are transmitted, through a channel 240, to the local loop and eventually the user 250.

Those skilled in the art will recognize that the channel 240 is PCM-based with a limited set, i.e. 255 in μ-law or A-law, of signal levels, since it is specified by the telephone networks. Those skilled in the art will also appreciate that the transmitter 210 must be one using lossless coding such that no information is lost between source samples 200 and transmitted samples 220. To avoid sending the low-frequency energy to the channel 240, the low-frequency component must be eliminated (230) as the source samples 200 are coded by the transmitter 210 based on a set of characteristics of the frequency spectrum. In other words, the running digital sum (“RDS”) of any block of source samples must be minimized, which means that the low frequency energy is partially offset or entirely eliminated. Also, there must be redundancy added to ensure a lossless coding by the transmitter.

The conventional way of making RDS bounded is to use an Alternate Marking Input (“AMI”) method, which generates additional, but opposite, voltage levels for the samples to bring the RDS to within a symbol size. The AMI, however, is unacceptable for PCM channels, since there is a fixed set of signal points, or voltage levels for the PCM channel as dictated by the telephone networks.

Reference is to FIG. 3, where a generalized process flow of the spectral shaping methodology in accordance with one aspect of the present invention is shown. First, a block of source samples 300 is applied to the transmitter for coding based on a set of predetermined characteristics of the transmit frequency spectrum. For each sample, a predetermined component is measured (310).

Broadly, the measure of the unwanted signal components of the transmitted samples upto the current sample can be accomplished using a Running Filter Sum (RFS). If the corresponding filter coefficients are selected to be a Fourier basis function, then the measure becomes Running Discrete Fourier Transform (RDFT) or Running Fast Fourier Transform (RFFT). It is more convenient to use RDFT or RFFT to form a set of frequency null. If only D.C. is of concern, then the measure reduces to RDS.

For every block of a predetemined number of transmitted samples, an objective function is computed (320) based on the measure already obtained. Note that the objective functions may be computed using any one of the following well-known techniques:

a) L-2 Norm of the measurement;

b) L-1 Norm of the measurement;

c) L-α Norm (for 1<α<2);

d) a weighted version of L-2 Norm;

e) a weighted version of L-1 Norm;

f) a weighted version of L-α Norm (for 1<α<2).

Finally, for every block of source samples, at least one redundant sample is added or at least one source sample is modified (330), e.g. the sign of the sample is modified, such that it will optimize the objective function. When the objective function is optimized, the unwanted signal component is minimized, e.g. the energy of the unwanted signal component is minimized.

It should be noted that the source samples are not intended to be limited to real values. However, for illustration purposes in the disclosure, only real numbers are considered.

It should be apparent to those skilled in the art that when applied to the energy at 0 Hz, the methodology will minimize the unwanted DC component in the transmitted samples. As can be appreciated by those skilled in the art, the methodology will provide arbitrary spectral-shaping, or coding, of the transmitted samples, whatever the characteristics of the transmit spectrum require.

The following description will first disclose the present invention in the context of spectral shaping in a simple DC null, followed by spectral shaping in multiple frequency nulls and then eventually to spectral pre-coding based on a predetermined spectrum shape. For the purposes of illustration in the following description, transmitted samples can be classified as source samples and dependent samples, where the source samples are unmodified and the dependent samples are either redundant samples or modified source samples, e.g. sign-modified, or both. In all measures described herein, the location of the dependent sample can be anywhere in the block, structurally (including pseudo-randomized) or randomly. If randomly, the location index must be transparent to the receiver, i.e. encoded into the transmitter sequence. For simplicity of the description below, we assume the locations of the dependent samples remain the same for all the blocks. Those skilled in the art can readily adapt the present invention for those scrambled locations based on the teaching of the present invention.

A. A Simple DC Null.

In accordance with the present invention, the effect of the DC nulls of the transformer hybrids at the PCM CODEC can be avoided by creating a DC-null in the transmit spectrum.

1) Redundant Sample

This can be done by letting every L^(th), e.g. L=16, sample counteract the DC introduced by previous samples.

Given the output signal x_(n), let us define a DC measurement c_(n), $c_{n} = {\sum\limits_{m = 0}^{n}{x_{m}.}}$

This is commonly known as the RDS approach. If we, when n is a multiple of L, let x_(n)=Q(31 c_(n−1)), where Q(.) quantizes its input to the closest value in the PCM digital-to-analog converter, the DC component of the signal will be greatly attenuated, i.e.: $x_{n} = \left\{ {\begin{matrix} {M\left( d_{n} \right)} & {{{if}\quad n} \neq {Lr}} \\ {Q\left( {- c_{n - 1}} \right)} & {{{if}\quad n} = {Lr}} \end{matrix},{r\quad \text{is~~a~~non-negative~~integer,}}} \right.$

where M is a suitable mapping function from data to a subset of the PCM quantization values. FIG. 4 illustrates the signal spectrum with simple redundant-sample method, where the null is at 0 Hz.

2) Redundant Sign

Another method is to modify the sign of every L, e.g. L=2, sample based on c_(n−1), then, $x_{n} = \left\{ {\begin{matrix} {M\left( d_{n} \right)} & {{{if}\quad n} \neq {Lr}} \\ {{{sgn}\left( {- c_{n - 1}} \right)}{M^{\prime}\left( d_{n} \right)}} & {{{if}\quad n} = {Lr}} \end{matrix},{r\quad \text{is~~a~~non-negative~~integer,}}} \right.$

where M′ only selects positive quantization values. Clearly, d_(n) should preferably have one less bit when n=L k.

FIG. 5 illustrates the signal spectrum with simple redundant-sign method, where the null is at 0 Hz.

As can be observed from FIGS. 4 and 5, both methods create a DC-null in the transmit spectrum without much effect on the spectrum above 100 Hz. The receiver will not have to reconstruct the signal component at DC, thus greatly simplifying the receiver circuit.

B. Creating Nulls at Individual Frequencies.

1) Single Frequencies

The above-described methods can be generalized, or extended, to insert nulls (or rather, near-nulls) at any frequencies. Let us define c_(n) ^((k)) (now a complex number) as, ${c_{n}^{(k)} = {\sum\limits_{m = 0}^{n}{x_{m}^{{- {j\omega}_{k}}m}}}},$

where Ω_(k) represents the frequency ƒ_(k)=Ω_(k)/2πT with symbol period T. If we make every L^(th), e.g. L=16, sample dependent, then we select the dependent samples to minimize C_(n)^((k))².

It should be noted that L is not restricted to 16 in any sense and those skilled in the art can readily apply a different value in accordance with their special applications. It can readily be shown that the best selection for x_(n) is then, x_(n) = Q(−Re[c_(n − 1)^((k))^(jω_(k)n)]).

It is then possible to have a generalization for the DC-null redundant-sample method as: $x_{n} = \left\{ {\begin{matrix} {M\left( d_{n} \right)} & {{{if}\quad n} \neq {Lk}} \\ {Q\left( {- {{Re}\left\lbrack {c_{n - 1}^{(k)}^{{j\omega}_{k}n}} \right\rbrack}} \right)} & {{{if}\quad n} = {Lk}} \end{matrix},{{e.g.\quad L} = 16.}} \right.$

FIG. 6 illustrates the signal spectrum with simple redundant-sample method, where the null is now at 60 Hz.

A generalization for the DC-null redundant-sign method is now, $x_{n} = \left\{ {\begin{matrix} {M\left( d_{n} \right)} & {{{if}\quad n} \neq {Lr}} \\ {{{sgn}\left( {- {{Re}\left\lbrack {c_{n - 1}^{(k)}^{{j\omega}_{k}n}} \right\rbrack}} \right)}{M^{\prime}\left( d_{n} \right)}} & {{{if}\quad n} = {Lr}} \end{matrix},{{e.g.\quad L} = 2.}} \right.$

FIG. 7 illustrates the signal spectrum with simple redundant-sign method, where the null is at 60 Hz. As can be observed by those skilled in the art, if Ω_(k)=0, this becomes the same as the special case with the DC null.

2) Multiple Frequencies

The generalized method as described above can in fact be done at more than one ii frequency. If we define a set of Ω_(k), k=0,1, . . . ,K−1, and minimize the sum of the (k) squared norms of c_(n) ^((k)), it can be found that the best selection for x_(n) for the redundant sample method is, $x_{n} = \left\{ {\begin{matrix} {M\left( d_{n} \right)} & {{{if}\quad n} \neq {Lr}} \\ {Q\left( {- c_{n - 1}} \right)} & {{{if}\quad n} = {Lr}} \end{matrix},} \right.$

${{{where}\quad C_{n}} = {\frac{1}{K}{\sum\limits_{k = 0}^{K - 1}{{Re}\left\lbrack {c_{n - 1}^{(k)}^{{j\omega}_{k}n}} \right\rbrack}}}},{{and}\quad {for}\quad {the}\quad {redundant}\quad {sign}\quad {method}},$

$x_{n} = \left\{ {\begin{matrix} {M\left( d_{n} \right)} & {{{if}\quad n} \neq {Lr}} \\ {{{sgn}\left( {- c_{n - 1}} \right)}{M^{\prime}\left( d_{n} \right)}} & {{{if}\quad n} = {Lr}} \end{matrix}.} \right.$

If the goal is to suppress a band of frequencies, then those skilled in the art can readily replace summation (Σ) with integration (∫) in calculating C_(n).

FIGS. 8 and 9 illustrate the signal spectrum with multiple frequency redundant-sample and multiple frequency redundant-sign methods, respectively, with nulls at 0 Hz and 60 Hz.

C. Block Coding of Redundant Samples

The performance of the above-described redundant-sample method can be further enhanced by considering blocks of data and jointly optimizing several redundant samples.

If we make every L^(th), e.g. L=16, samples redundant, then we can consider jointly optimizing N redundant samples in a super block of (N×16) samples. In other words, we would select x_(n), x_(n−16), . . . , x_(n−(N−1)*16) simultaneously to minimize the sum of squared norms of c_(n) ^((k)). It should be appreciated by those skilled in the art that the N jointly optimized redundant samples x_(n), x_(n−16), . . . , x_(n−(N−1)*16), without quantization, are roots of the following linear equation: A x=b, where $A = \begin{Bmatrix} K & {\sum\limits_{k = 0}^{K - 1}{\cos \quad \left( {16\omega_{k}} \right)}} & \cdots & {\sum\limits_{k = 0}^{K - 1}{\cos \quad \left( {16\left( {N - 1} \right)\omega_{k}} \right)}} \\ {\sum\limits_{k = 0}^{K - 1}{\cos \quad \left( {16\omega_{k}} \right)}} & K & \cdots & \vdots \\ \vdots & \cdots & ⋰ & {\sum\limits_{k = 0}^{K - 1}{\cos \quad \left( {16\omega_{k}} \right)}} \\ {\sum\limits_{k = 0}^{K - 1}{\cos \quad \left( {16\left( {N - 1} \right)\omega_{k}} \right)}} & \cdots & {\sum\limits_{k = 0}^{K - 1}{\cos \quad \left( {16\omega_{k}} \right)}} & K \end{Bmatrix}$ $x = \begin{Bmatrix} x_{n} \\ x_{n - 16} \\ \vdots \\ x_{n - {16{({N - 1})}}} \end{Bmatrix}$ $b = {- \begin{Bmatrix} {\sum\limits_{k = 0}^{K - 1}{{Re}\left\lbrack {c_{n - 1}^{(k)}^{{j\omega}_{k}n}} \right\rbrack}} \\ {\sum\limits_{k = 0}^{K - 1}{{Re}\left\lbrack {c_{n - 1}^{(k)}^{{j\omega}_{k}{({n - 16})}}} \right\rbrack}} \\ \vdots \\ {\sum\limits_{k = 0}^{K - 1}{{Re}\left\lbrack {c_{n - 1}^{(k)}^{{j\omega}_{k}{({n - {{({N - 1})}16}})}}} \right\rbrack}} \end{Bmatrix}}$

Here the term ${{c_{n - 1}^{(k)}\quad {is}\quad c_{n - 1}^{(k)}} = {\sum\limits_{\underset{\underset{{\ldots \quad n} - {16{({N - 1})}}}{{m \neq {n - 16}},{n - 32},}}{m = 0}}^{n - 1}{x_{m}^{{- {j\omega}_{k}}m}}}},$

which is slightly different from before.

When each entry of x can only take value from a finite set of quantization values, the exact solution of x will be replaced by its quantized version. A simple way to get a quantized version of roots of above linear equation is independently quantizing each of the entries. A more preferred way will be jointly quantizing the whole vector by searching through a small neighborhood of x and finding the quantized candidate vector which minimizes the sum of the squared norms of c_(n) ^((k)).

It should readily be appreciated by those skilled in the art that using FFT to perform coding of redundant samples is a trivial extension of the above-described methodology. In that case, $c_{n}^{(k)} = {\sum\limits_{m = 0}^{n}{x_{m}^{{- {j\omega}_{k}}m}}}$

will be replaced by ${c_{p}^{(k)} = {\sum\limits_{m = 0}^{P - 1}{x_{m}^{{- j}\frac{2\pi \quad k}{p}m}}}},$

where c_(P) ^((k)) corresponds to the FFT at the actual frequency of ƒ_(k)=k/PT.

D. Block Coding of Redundant Signs

The Redundant Sign method as described above can be further improved by considering blocks of data. Several signs within the block can be selected in combination to optimize. For example, if we consider a block of 4 samples, and first select positive quantization points for each sample based on the input data. Assuming a redundancy of {fraction (1/16)}, we then need to encode 2 more bits for the block, and have 2 degrees of freedom. We now want to select the set of 4 signs S_(n)=(s_(n),s_(n+1),s_(n+2), s_(n+3)) to minimize the energy at the selected frequencies ƒ_(k), given x′_(n+l)=M′(d_(n+l)), l=0,1,2,3 and c_(n − 1)^((k)), k = 0, 1, …  , K − 1.

In effect, we want to direct the vector X′_(n)=(x′_(n),x′_(n+1),x′_(n+2),x′_(n+3)) in such a way as to minimize C_(n). We are restricted by 2 bits, but the other 2 bits can be selected. Suppose the set of possible S_(n) is divided into 4 subsets A_(i), i=0,1,2,3, and a subset is selected based on the input bits, then a S_(n) is selected out of the 4 subset members to minimize C_(n). Then we would want the elements of each subset to be as different from each other as possible, in order to handle a variety of different X_(n) well.

One way to spread the S_(n) is to construct a binary code, where each subset has members with maximum distance between them, and the subsets are cosets of each other. One example would be:

A₀=(0000,0011,1100,1111)

A₁=(0001,0010,1101,1110)

A₂=(0100,0111,1000,1011),

where the binary codes represent the sign

A₃ =(0101,0110,1001,1010)

combinations where a “0” represents “+”, and a “1” represents “−”. Here, the 2 data bits would select one of the 4 subsets, and then the sign combinations in each subset would be tested to find which one gave the lowest C_(n).

That sign combination would then be used to multiply the positive input samples. In the receiver, the decoding operation would identify the signs. The receiver would then find which subset the sign combination belonged to, and output the 2 bits corresponding to that subset.

As can be observed by those skilled in the art, an interesting side-benefit is that for each subset, the negative of each member of the subset is also in the subset. Thus, if the signal gets multiplied by −1 in the channel, the resulting subset sequence is unchanged. Therefore, no differential encoding/decoding is necessary, the coding system is sign-invariant.

FIGS. 10 and 11 illustrate the signal spectrums with redundant-sign block code method, where block size is 4 and nulls at 0, 60 Hz and 0, 30, 60 Hz, respectively.

As can be expected, the larger the subset, the better the performance. One example of a subset structure for a block length of 8, where one still assumes a redundancy of {fraction (1/16)}, is illustrated in Table 1 (now using hexadecimal notation).

TABLE 1 Sign combination subsets for frame length 8. Sct 0 00 0F 33 3C 55 5A 66 69 FF F0 CC C3 AA A5 99 96 1 01 0E 32 3D 54 5D 67 68 FE F1 CD C2 AB A4 98 97 2 02 0D 31 3E 57 58 64 6B FD F2 CE C1 A8 A7 9B 94 3 03 0C 30 3F 56 59 65 6A FC F3 CF C0 A9 A6 9A 95 4 04 0B 37 38 51 5E 62 6D FB F4 C8 C7 AE A1 9D 92 5 05 0A 36 39 50 5F 63 6C FA F5 C9 C6 AF AD 9C 93 6 06 09 35 3A 53 5C 60 6F F9 F6 CA C5 AC A3 9F 90 7 07 08 34 3B 52 5D 61 6E F8 F7 CB C4 AD A2 9E 91 8 10 1F 23 2C 45 4A 76 79 EF E0 DC D3 BA B5 89 86 9 11 1E 22 2D 44 4B 77 78 EE E1 DD D2 BB B4 88 87 10  12 1D 21 2E 47 48 74 7B ED E2 DE D1 B8 B7 88 84 11  13 1C 20 2F 46 49 75 7A EC E3 DF DD B9 B6 8A 85 12  14 1B 37 28 41 4E 72 7D E5 E4 D8 D7 BE B1 8D 82 13  15 1A 26 29 40 4F 73 7C EA E5 D9 D5 BF B0 8C 83 14  16 19 25 2A 43 4C 70 7F E9 E6 DA D5 BC B3 8F 80 15  17 18 24 2B 42 4D 71 7E E8 E7 DB D4 BD B2 8E 81

FIGS. 12 and 13 show the signal spectrum for the block size of 8, inserting nulls at 0, 60 Hz and 0, 6, 12, 18, . . . , 60 Hz, respectively.

If more attenuation is desired, the block size can be increased to 16 or even higher, although the computational complexity will grow considerably. The redundancy can also be increased. For a redundancy of ⅛, all sign-bits are available for manipulation. This will increase the low-frequency attenuation over that shown in FIGS. 9 and 10 by more than 10 dB.

E. Spectral Precoding According to a Specified Spectral Shape

The foregoing methods can be further generalized to shape transmitted sequence spectrum with respect to a specified spectral characteristic. Let the z-transform of the desired spectral shaping function be G(z) and its inverse be defined as ${{F(z)} = {{1/{G(z)}} = {\sum\limits_{m = {- \infty}}^{\infty}{f_{m}z^{- m}}}}},$

where the filter coefficient, ƒ_(m), can be complex-valued.

In practice, we might be only interested in the cases where F(z) is causal, i.e., ƒ_(m)=0, for all m<0, or we may use a delayed and windowed version of F(z). In addition, we might prefer F(z) to be minimum phase. This can be done by selecting an all-pass filter A(z) such that F(z) is minimum phase and ${{F(z)} = \frac{A(z)}{G(z)}},$

where |F(e^(−jΩ))|=1/|G(e^(−jΩ))| and F(z) is assumed to be causal and stable. Once we have obtained the desired filter coefficients {ƒ_(m)}, the unwanted signal component contained in the available sequence {x_(m)} for 0≦m≦n at epoch n can be written as: $c_{n} = {\sum\limits_{m = 0}^{n}{x_{m}{f_{n - m}.}}}$

Its energy can be reduced or completely canceled by jointly optimizing several redundant samples which will be selected with respect to the dominant weights of ƒ_(m) or jointly selecting several redundant signs. These two methods are similar to the aforementioned block coding with redundant samples and block coding with redundant signs.

The only difference is in the performance measure. To state clearly, we define the set of L dominant tap indices of ƒ_(m) as . Then for each block of N samples, where suppose N>max{},we select L redundant samples x_(n−l), ∀lε subject to saturation and quantization constraints of PCM signaling or select L redundant signs s_(n−l), ∀lε such that |c_(n)|² is minimized. The search of the optimal redundant samples or signs is straightforward. Any of the constrained linear programming algorithms would be sufficient, as can be appreciated by those skilled in the art.

For illustration purposes, we consider a special case where the most dominant tap is ƒ₀. Further, we assume ƒ₀ is real-valued without loss of generality. For this case, it is reasonable to modify the current sample x_(n) according to c_(n−1) to minimize |c_(n)|². The parameter c_(n−1) here is referred to as a running filter sum (RFS) at time n−1. If the “redundant-sample” method is employed for each block of N samples, then the desired sequence can be constructed as $x_{n} = \left\{ {\begin{matrix} {M\left( d_{n} \right)} & {{{if}\quad n} \neq {rL}} \\ {Q\left( {{- c_{n - 1}}/f_{0}} \right)} & {{{if}\quad n} = {rL}} \end{matrix}.} \right.$

If the “redundant-sign” method is used, then the desired sequence is given as $x_{n} = \left\{ {\begin{matrix} {M\left( d_{n} \right)} & {{{if}\quad n} \neq {rL}} \\ {{{sgn}\left( {{- c_{n - 1}}/f_{0}} \right)}{M^{\prime}\left( d_{n} \right)}} & {{{if}\quad n} = {rL}} \end{matrix},} \right.$

where M′(d_(n))=|M(d_(n))|. It can be shown that as long as the RFS is bounded, the constructed sequence satisfies the specified spectral requirements. Note that if we choose G(z)=1−z⁻¹, then ƒ_(m)=1 for all m≧0. The RFS then reduces to RDS. If we choose G(z)=1−e^(−jΩ)z⁻¹, then ƒ_(m)=e^(−jΩm) for all m≧0 and a given normalized frequency Ω. The RFS reduces to RFT.

In order to demonstrate the effectiveness of the various methods in accordance with the present invention, we consider G(z)=1−z⁻², a so-called modified duobinary signal. This class of sequences does not possess a sharp discontinuity at Nyquist frequency and as a result, it can be easily approximated by a physically realizable filter. It can be shown that the corresponding inverse filter is given as, ${{F(z)} = {\sum\limits_{m = 0}^{\infty}z^{{- 2}m}}},$

where we select (ROC) |z|<1. Accordingly, we can use two separate RDS' to account for the even samples and the odd samples respectively, $c_{n} = \left\{ {\begin{matrix} {\sum\limits_{m = 0}^{n/2}x_{2m}} & {{if}\quad n\quad {is}\quad {even}} \\ {\sum\limits_{m = 0}^{{({n - 1})}/2}x_{{2m} + 1}} & {{if}\quad n\quad {is}\quad {odd}} \end{matrix}.} \right.$

The sequence {x_(n)} can be constructed by any of the aforementioned methods.

FIG. 14 shows the power spectrum of the sequence constructed by the redundant-sign method for a block length of N=4 with a redundancy of {fraction (1/16)}.

The last example considers G(z)=1−αz⁻¹ where the weighting factor α or forgetting factor can be used to control the memory of the residual running digital sum at the cost of slightly lower attenuation at DC. FIG. 15 gives the power spectrum of such sequence constructed by the redundant sample method (N=8, α=0.99).

Although only a few exemplary embodiments of this invention have been described in detail above, those skilled in the art will readily appreciate that many modifications are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of this invention. Accordingly, all such modifications are intended to be included within the scope of this invention as defined in the following claims. In the claims, means-plus-function clauses are intended to cover the structures described herein as performing the recited function and not only structural equivalents but also equivalent structures. Thus although a nail and a screw may not be structural equivalents in that a nail employs a cylindrical surface to secure wooden parts together, whereas a screw employs a helical surface, in the environment of fastening wooden parts, a nail and a screw may be equivalent structures. 

What is claimed is:
 1. A method of spectrally shaping transmitted samples with a set of predetermined frequency characteristics and a predetermined set of allowable transmitted signal levels, wherein a transmitted sample is either of an unmodified source sample or a dependent sample, comprising the steps of: a) calculating, for each of the transmitted samples, a running measure of unwanted components up to the current sample; b) computing, for each block of the transmitted samples, an objective function based on the running measure calculated in Step a), wherein said objective function shapes the source samples to a predetermined spectrum characterized by a set of filter coefficients associated with a transmitter of said transmitted samples; c) selecting, for each block of the transmitted samples, at least one redundant sample to be added or at least one transmitted sample to be modified, at structured or randomized location within the block to optimize the objective function in Step b).
 2. A method as in claim 1, wherein the location of the dependent sample can be one of fixed, scrambled (pseudo random) or randomized.
 3. The method according to claim 1, wherein the Step b) of computing comprises computing one of the following: a) a Running Filter Sum; b) a Running Fourier Transform (“RFT”) or Fast FT (“RFFT”); c) a RDS, for each transmitted sample.
 4. The method according to claim 1, wherein the Step b) of computing comprises computing a Running Filter Sum.
 5. The method according to claim 1, wherein the Step b) of computing comprises computing either a Running Fourier Transform (“RFT”) or Fast FT.
 6. The method according to claim 1, wherein the Step b) of computing comprises computing a RDS, for each transmitted sample.
 7. A method as in claim 1, wherein the Step of selecting comprising jointly selecting redundant samples or redundant signs to optimize the objective function.
 8. A method of lossless spectral shaping or coding of source samples to transmitted samples based on a set of predetermined characteristics of a frequency spectrum, where the allowable signal levels of the transmitted samples are limited to a predescribed set, comprising the steps of: a) for each source sample, calculating any one of the following: i) an RDS, to obtain a measurement of the DC component of the source sample up to this block; ii) a RDFT or RFFT, to obtain a measure of unwanted signal components of the source sample up to this block; iii) a Running Filter Sum, to obtain a measure of unwanted signal components of the source sample up to this block; b) for every block of a determined plurality (“N”) of source samples, computing an objective function based on the measure obtained from Step a), wherein said objective function shapes the source samples to a predetermined spectrum characterized by a set of filter coefficients associated with a transmitter of said transmitted samples; c) for every block of said determined plurality (“N”) of source samples, selecting one of: i) at least one redundant sample, ii) at least one redundant sign or iii) both of at least one redundant sample and at least one redundant sign, to optimize the objective function in Step b).
 9. A method according to claim 8, further comprising the step of quantizing the redundant sample where the signal set is limited.
 10. A method according to claim 8, wherein the objective function is computed based on any one of the following methods: d) L-2 Norm (Least Square) of the measure obtained in Step a); e) L1 Norm (Absolute Value) of the measure obtained in Step a); f) L-alpha Norm (where 1<α, 2) of the measurement obtained in a), where L-alpha Norm is represented as: |x|^(α)=Σ|x_(i)|^(α), for i=1, . . . , N g) a weighted version of d); h) a weighted version of e); i) a weighted version of f).
 11. A method according to claim 8, where the objective function is to create at least one null at at least one arbitrary frequency.
 12. A method according to claim 8, where the objective function shapes the source samples to a predetermined spectrum, where the spectrum is described by a set of filter coefficients.
 13. In a transmitter for data communications with a limited number of signal points, a method of spectral shaping transmitted samples, wherein each transmitted sample is either of an unmodified source sample or a dependent sample comprising the steps of: a) for each transmitted sample x_(n), calculating K values of c_(n) ^((k)): ${c_{n}^{(k)} = {{\sum\limits_{m = 0}^{n}{x_{m}^{{- {j\omega}_{k}}m}\quad \omega_{k}}} = {2\pi \quad f_{k}T}}},{k = 0},1,\ldots \quad,{K - 1},{{K \geq 1};}$

b) calculating a measure of unwanted signal components ${C_{n} = {\frac{1}{K}{\sum\limits_{k = 0}^{K - 1}{c_{n}^{(k)}}^{2}}}};$

c) minimizing C_(n) by selecting at least one dependent sample; d) spectrally shaping, using said transmitter, said transmitted samples in accordance with said at least one dependent sample.
 14. A method as in claim 13, wherein K>1 or K=1, f₀>0 Hz.
 15. A method as in claim 13, wherein K=2, f₀=0, f₁=60 Hz.
 16. A method as in claim 13, wherein K=2, f₀=0, f₁=50 Hz.
 17. A method as in claim 13, wherein K>2, f_(k)≦60 Hz, k=0,1, . . . ,K−1.
 18. A method as in claim 13, wherein the Step of minimizing is performed by selecting every L^(th) sample as a dependent sample based on C_(n) and independent of input data, and the other L-1 samples not dependent on C_(n), and either K>1 or f₀>0 for K=1.
 19. A method as in claim 18, wherein K=1, f₀≠0.
 20. A method as in claim 18, wherein K=2, f₀=0, f₁=60 Hz.
 21. A method as in claim 18, wherein K=2, f₀=0, f₁=50 Hz.
 22. A method as in claim 18, wherein K>2, f_(k)≦60 Hz, k=0,1, . . . ,K−1.
 23. A method as in claim 18, wherein L=8.
 24. A method as in claim 18, wherein L=16.
 25. A method as in claim 18, wherein the Step of minimzing is performed by selecting the sign of every L^(th) sample based on C_(n) and independent of input source data, and the other L-1 samples not dependent on C_(n).
 26. A method as in claim 25, wherein either K>1 or K=1, f₀>0 Hz.
 27. A method as in claim 25, wherein K=2, f₀=0, f₁=60 Hz.
 28. A method as in claim 25, wherein K=2, f₀=0, f₁=50 Hz.
 29. A method as in claim 25, wherein K>2, f_(k)≦60 Hz, k=0,1, . . . ,K−1.
 30. A method as in claim 25, wherein L=1,2 or
 4. 31. A method as in claim 18, wherein N dependent samples are selected jointly based on N(L-1) independent samples and C_(n).
 32. A method as in claim 31, where K=1.
 33. A method as in claim 31, where K=2, f₀=0, f₁=60 Hz.
 34. A method as in claim 31, where K=2, f₀=0, f₁=50 Hz.
 35. A method as in claim 31, where K>2, f_(k)≦60 Hz, k=0,1, . . . ,K−1.
 36. A method as in claim 31, where L=8 or 16, N=2 or 3 or
 4. 37. A method as in claim 13, where the Step of minimizing is performed by for each N output samples, selecting N positive samples based on input data, then selecting a M-element subset of the 2^(N) possible sign combinations based on input data, and then selecting one of the M sign combinations from the subset to minimize C_(n) and independent of input data, then using the selected sign combination to determine the sign of the output data.
 38. A method as in claim 37, where the M-element subsets are selected in such a way as to maximize the Hamming distance between the subsets, considering the signs as 0's and 1's of a binary codeword.
 39. A method as in claim 37, where M is a power of
 2. 40. A method as in claim 37, where N=2,4, or 8, M=2^(N−1).
 41. A method as in claim 37, where N=2,4, or 8, M=2^(N).
 42. A method as in claim 37, where K=1.
 43. A method as in claim 37, where K=2, f₀=0, f₁=60 Hz.
 44. A method as in claim 37, where K=2, f₀=0, f₁=50 Hz.
 45. A method as in claim 37, where K>2, f_(k)≦60 Hz, k=0,1, . . . ,K−1.
 46. In a transmitter for data communications with a limited number of signal points, a method of arbitrary spectral-shaping of transmitted samples according to a predetermined filter characteristics G(z), wherein the transmitted sample is either of an unmodified source sample or a dependent sample, comprising the steps of: a) computing a plurality of filter coefficients {ƒ_(m)} of the inverse filter of G(z); b) for each transmitted sample x_(n), calculating unwanted signal component measure c_(n) based on ${c_{n} = {\sum\limits_{m = 0}^{n}{x_{m}f_{n - m}}}};$

c) minimizing c_(n) by selecting at least one dependent sample x_(n); d) spectrally shaping, using said transmitter, said transmitted samples in accordance with said at least one dependent sample x_(n).
 47. A method according to claim 46, wherein the at least one dependent sample is a dependently selected redundant sample.
 48. A method according to claim 46, wherein the at least one dependent sample is a dependently modified source sample, either sign-modifed or sign-and-magnitude modified.
 49. A method according to claim 46, where f₁=1, for all m≧0.
 50. A method according to claim 46, where f_(m)=α, for all m≧0,0<α<1.
 51. A method according to claim 46, where G(z)=1−αz⁻², 0<α≦1. 